منابع مشابه
Stable Models of Formulas with Generalized Quantifiers
Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to incorporate aggregates and abstract constraint atoms, to facilitate interface with external information sources, such as ontology descriptions, and to integrate with other computing paradigms, such as constraint solving. This paper provides a uniform view on some of these extensio...
متن کاملStable Models of Formulas with Generalized Quantifiers (Preliminary Report)
Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to allow aggregates or to facilitate interface with external ontology descriptions. We present a uniform, reductive view on these extensions by viewing them as special cases of formulas with generalized quantifiers. This is done by extending the first-order stable model semantics by ...
متن کاملQuery Languages with Generalized Quantifiers
Various existing query languages allow queries with embedded sub-queries as well as sub-query comparison statements. It is often argued that these features enhance the declarativeness of the query language. We establish a link between between the phenomenon of sub-query syntax in query languages and the theory of generalized quantifiers as it was introduced by Barwise and Cooper in linguistics....
متن کاملScope Dominance with Generalized Quantifiers
When two quantifiers Q1 and Q2 satisfy the scheme Q1x Q2y φ → Q2y Q1x φ, we say that Q1 is scopally dominant over Q2. This relation is central in analyzing and computing entailment relations between different readings of ambiguous sentences in natural language. This paper reviews the known results on scope dominance and mentions some open problems.
متن کاملGeneralized Quantifiers
We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1975
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891621